TSTP Solution File: NUM793^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 10:45:44 EDT 2024
% Result : Theorem 3.86s 1.83s
% Output : Refutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 41 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 68 ( 5 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 162 ( 15 ~; 13 |; 0 &; 122 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 ^ 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(rat_type,type,
rat: $tType ).
thf(x0_type,type,
x0: rat ).
thf(y0_type,type,
y0: rat ).
thf(z0_type,type,
z0: rat ).
thf(more_type,type,
more: rat > rat > $o ).
thf(moreis_type,type,
moreis: rat > rat > $o ).
thf(less_type,type,
less: rat > rat > $o ).
thf(lessis_type,type,
lessis: rat > rat > $o ).
thf(3,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(10,plain,
more @ x0 @ y0,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
! [A: rat,B: rat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz82) ).
thf(19,plain,
! [A: rat,B: rat] :
( ( more @ A @ B )
=> ( less @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,plain,
! [B: rat,A: rat] :
( ~ ( more @ A @ B )
| ( less @ B @ A ) ),
inference(cnf,[status(esa)],[19]) ).
thf(61,plain,
! [B: rat,A: rat] :
( ( less @ B @ A )
| ( ( more @ x0 @ y0 )
!= ( more @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[10,20]) ).
thf(62,plain,
less @ y0 @ x0,
inference(pattern_uni,[status(thm)],[61:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).
thf(4,axiom,
moreis @ y0 @ z0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(11,plain,
moreis @ y0 @ z0,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(7,axiom,
! [A: rat,B: rat] :
( ( moreis @ A @ B )
=> ( lessis @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz84) ).
thf(17,plain,
! [A: rat,B: rat] :
( ( moreis @ A @ B )
=> ( lessis @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [B: rat,A: rat] :
( ~ ( moreis @ A @ B )
| ( lessis @ B @ A ) ),
inference(cnf,[status(esa)],[17]) ).
thf(47,plain,
! [B: rat,A: rat] :
( ( lessis @ B @ A )
| ( ( moreis @ y0 @ z0 )
!= ( moreis @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,18]) ).
thf(48,plain,
lessis @ z0 @ y0,
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( y0 )),bind(B,$thf( z0 ))]]) ).
thf(6,axiom,
! [A: rat,B: rat,C: rat] :
( ( lessis @ A @ B )
=> ( ( less @ B @ C )
=> ( less @ A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz87a) ).
thf(14,plain,
! [A: rat,B: rat,C: rat] :
( ( lessis @ A @ B )
=> ( ( less @ B @ C )
=> ( less @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(15,plain,
! [A: rat,B: rat] :
( ( lessis @ A @ B )
=> ! [C: rat] :
( ( less @ B @ C )
=> ( less @ A @ C ) ) ),
inference(miniscope,[status(thm)],[14]) ).
thf(16,plain,
! [C: rat,B: rat,A: rat] :
( ~ ( lessis @ A @ B )
| ~ ( less @ B @ C )
| ( less @ A @ C ) ),
inference(cnf,[status(esa)],[15]) ).
thf(56,plain,
! [C: rat,B: rat,A: rat] :
( ~ ( less @ B @ C )
| ( less @ A @ C )
| ( ( lessis @ z0 @ y0 )
!= ( lessis @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[48,16]) ).
thf(57,plain,
! [A: rat] :
( ~ ( less @ y0 @ A )
| ( less @ z0 @ A ) ),
inference(pattern_uni,[status(thm)],[56:[bind(A,$thf( z0 )),bind(B,$thf( y0 ))]]) ).
thf(60,plain,
! [A: rat] :
( ~ ( less @ y0 @ A )
| ( less @ z0 @ A ) ),
inference(simp,[status(thm)],[57]) ).
thf(90,plain,
! [A: rat] :
( ( less @ z0 @ A )
| ( ( less @ y0 @ x0 )
!= ( less @ y0 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[62,60]) ).
thf(91,plain,
less @ z0 @ x0,
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( x0 ))]]) ).
thf(5,axiom,
! [A: rat,B: rat] :
( ( less @ A @ B )
=> ( more @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz83) ).
thf(12,plain,
! [A: rat,B: rat] :
( ( less @ A @ B )
=> ( more @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
! [B: rat,A: rat] :
( ~ ( less @ A @ B )
| ( more @ B @ A ) ),
inference(cnf,[status(esa)],[12]) ).
thf(99,plain,
! [B: rat,A: rat] :
( ( more @ B @ A )
| ( ( less @ z0 @ x0 )
!= ( less @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[91,13]) ).
thf(100,plain,
more @ x0 @ z0,
inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( z0 )),bind(B,$thf( x0 ))]]) ).
thf(1,conjecture,
more @ x0 @ z0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz87d) ).
thf(2,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ( more @ x0 @ z0 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(106,plain,
$false,
inference(rewrite,[status(thm)],[100,9]) ).
thf(107,plain,
$false,
inference(simp,[status(thm)],[106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 6 19:54:39 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.87/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (112ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.46/1.16 % [INFO] nitpick registered as external prover.
% 1.46/1.17 % [INFO] Scanning for conjecture ...
% 1.70/1.21 % [INFO] Found a conjecture and 6 axioms. Running axiom selection ...
% 1.70/1.23 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 1.81/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.81/1.24 % [INFO] Type checking passed.
% 1.81/1.25 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.86/1.82 % [INFO] Killing All external provers ...
% 3.86/1.83 % Time passed: 1309ms (effective reasoning time: 860ms)
% 3.86/1.83 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 3.86/1.83 % Axioms used in derivation (6): satz87a, n, satz84, m, satz83, satz82
% 3.86/1.83 % No. of inferences in proof: 33
% 3.86/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1309 ms resp. 860 ms w/o parsing
% 3.86/1.86 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.86/1.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------